A Subspace Extraction Strategy for Many-objective Space Partitioning Optimization
نویسندگان
چکیده
This works extends a space partition search framework to divide the objective space into overlapping subspaces and propose a new conflict-based strategy to select the most conflicting subspaces for search. We test the effectiveness of the proposed strategy to improve the performance search of a multi-objective optimization algorithm on manyobjective problems with non-redundant objectives.
منابع مشابه
Assessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملMulti Objective Inclined Planes System Optimization Algorithm for VLSI Circuit Partitioning
In this paper multi objective optimization problem for partitioning process of VLSI circuit optimization is solved using IPO algorithm. The methodology used in this paper is based upon the dynamic of sliding motion along a frictionless inclined plane. In this work, modules and elements of the circuit are divided into two smaller parts (components) in order to minimize the cutsize and area imbal...
متن کاملA Manifold Approach to Learning Mutually Orthogonal Subspaces
Although many machine learning algorithms involve learning subspaces with particular characteristics, optimizing a parameter matrix that is constrained to represent a subspace can be challenging. One solution is to use Riemannian optimization methods that enforce such constraints implicitly, leveraging the fact that the feasible parameter values form a manifold. While Riemannian methods exist f...
متن کاملAdaptive matrix distances aiming at optimum regression subspaces
Abstract. A new supervised adaptive metric approach is introduced for mapping an input vector space to a plottable low-dimensional subspace in which the pairwise distances are in maximum correlation with distances of the associated target space. The formalism of multivariate subspace regression (MSR) is based on cost function optimization, and it allows assessing the relevance of input vector a...
متن کاملFrequency Domain Identiication, Subspace Methods and Periodic Excitation
Recent frequency domain identiication algorithms based on subspace based techniques are discussed. The algorithms construct a state-space model by means of extraction of the signal subspace from a matrix constructed from frequency data. A singular value decomposition plays a key part in the subspace extraction. The subspace methods are non-iterative methods in contrast to classical iterative pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014